Tree-connected peer group situations and peer group games
نویسندگان
چکیده
منابع مشابه
Tree-connected peer group situations and peer group games
A class of cooperative games is introduced which arises from situations in which a set of agents is hierarchically structured and where potential individual economic abilities interfere with the behavioristic rules induced by the organization structure. These games form a cone generated by a specific class of unanimity games, namely those based on coalitions called peer groups. Different econom...
متن کاملGroup Formation Among Peer-to-Peer Agents: Learning Group Characteristics
This paper examines the decentralized formation of groups within a peer-to-peer multi-agent system. More specifically, it frames group formation as a clustering problem, and examines how to determine cluster characteristics such as area and density in the absence of information about the entire data set, such as the number of points, the number of clusters, or the maximum distance between point...
متن کاملGroup Membership for Peer-to-Peer Communication
This paper studies the problem of maintaining eventual consistent group membership without any synchrony assumption inside an unbounded group G of processes that varies over the time (processes may join and leave the group). Eventual consistency means that if at any time all group membership changes cease, processes will converge in a finite time to a single consistent view. Due to the lack of ...
متن کاملInterest-Based Peer-to-Peer Group Management
Peer-to-Peer systems become popular applications but suffer from insufficient resource availability which is caused by free-riders and inefficient lookup algorithms. To address the first cause, a number of recent works have focused on providing appropriate incentive mechanisms to encourage participants to contribute their resources to the P2P systems. To improve the lookup efficiency, locality-...
متن کاملStrongly essential coalitions and the nucleolus of peer group games
Most of the known e cient algorithms designed to compute the nucleolus for special classes of balanced games are based on two facts: (i) in any balanced game, the coalitions which actually determine the nucleolus are essential; and (ii) all essential coalitions in any of the games in the class belong to a prespeci ed collection of size polynomial in the number of players. We consider a subclass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research (ZOR)
سال: 2002
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s001860200176